Combining Two Worlds: Parameterised Approximation for Vertex Cover
Identifieur interne : 000025 ( LNCS/Analysis ); précédent : 000024; suivant : 000026Combining Two Worlds: Parameterised Approximation for Vertex Cover
Auteurs : Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: We explore opportunities for parameterising constant factor approximation algorithms for vertex cover. We provide a simple algorithm that works on any approximation ratio of the form $\frac {2l+1}{l+1}$ and has complexity that outperforms an algorithm by Bourgeois et al. derived from a sophisticated exact parameterised algorithm. In particular, for l = 1 (factor 1.5 approximation) our algorithm runs in time $\mathcal{O}^{*}(1.09^{k})$ . Additionally, we present an improved polynomial-time approximation algorithm for graphs of average degree four.
Url:
DOI: 10.1007/978-3-642-17517-6_35
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001084
- to stream Istex, to step Curation: 000F73
- to stream Istex, to step Checkpoint: 000335
- to stream Main, to step Merge: 000D10
- to stream Main, to step Curation: 000C56
- to stream Main, to step Exploration: 000C56
- to stream LNCS, to step Extraction: 000025
Links to Exploration step
ISTEX:FFED7303E265FCB52EFA0AF797CBD4F935EACDC4Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Combining Two Worlds: Parameterised Approximation for Vertex Cover</title><author><name sortKey="Brankovic, Ljiljana" sort="Brankovic, Ljiljana" uniqKey="Brankovic L" first="Ljiljana" last="Brankovic">Ljiljana Brankovic</name></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FFED7303E265FCB52EFA0AF797CBD4F935EACDC4</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-17517-6_35</idno><idno type="url">https://api.istex.fr/document/FFED7303E265FCB52EFA0AF797CBD4F935EACDC4/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001084</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001084</idno><idno type="wicri:Area/Istex/Curation">000F73</idno><idno type="wicri:Area/Istex/Checkpoint">000335</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000335</idno><idno type="wicri:doubleKey">0302-9743:2010:Brankovic L:combining:two:worlds</idno><idno type="wicri:Area/Main/Merge">000D10</idno><idno type="wicri:Area/Main/Curation">000C56</idno><idno type="wicri:Area/Main/Exploration">000C56</idno><idno type="wicri:Area/LNCS/Extraction">000025</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Combining Two Worlds: Parameterised Approximation for Vertex Cover</title><author><name sortKey="Brankovic, Ljiljana" sort="Brankovic, Ljiljana" uniqKey="Brankovic L" first="Ljiljana" last="Brankovic">Ljiljana Brankovic</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>School of Electrical Engineering and Computer Science, The University of Newcastle, 2308, Callaghan, NSW</wicri:regionArea><wicri:noRegion>NSW</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich 4, Abteilung Informatik, Universität Trier, 54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">FFED7303E265FCB52EFA0AF797CBD4F935EACDC4</idno><idno type="DOI">10.1007/978-3-642-17517-6_35</idno><idno type="ChapterID">35</idno><idno type="ChapterID">Chap35</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We explore opportunities for parameterising constant factor approximation algorithms for vertex cover. We provide a simple algorithm that works on any approximation ratio of the form $\frac {2l+1}{l+1}$ and has complexity that outperforms an algorithm by Bourgeois et al. derived from a sophisticated exact parameterised algorithm. In particular, for l = 1 (factor 1.5 approximation) our algorithm runs in time $\mathcal{O}^{*}(1.09^{k})$ . Additionally, we present an improved polynomial-time approximation algorithm for graphs of average degree four.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Australie</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Australie"><noRegion><name sortKey="Brankovic, Ljiljana" sort="Brankovic, Ljiljana" uniqKey="Brankovic L" first="Ljiljana" last="Brankovic">Ljiljana Brankovic</name></noRegion><name sortKey="Brankovic, Ljiljana" sort="Brankovic, Ljiljana" uniqKey="Brankovic L" first="Ljiljana" last="Brankovic">Ljiljana Brankovic</name></country><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name></region><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000025 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000025 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:FFED7303E265FCB52EFA0AF797CBD4F935EACDC4
|texte= Combining Two Worlds: Parameterised Approximation for Vertex Cover
}}
| This area was generated with Dilib version V0.6.31. |  |